Transitive Packing
نویسندگان
چکیده
This paper is intended to give a concise understanding of the facial structure of previously separately investigated polyhedra. It introduces the notion of transitive packing and the transitive packing polytope and gives cutting plane proofs for huge classes of valid inequalities of this polytope. We introduce generalized cycle, generalized clique, generalized antihole, generalized antiweb, generalized web, and odd partition inequalities. These classes subsume several known classes of valid inequalities for several of the special cases but give also many new inequalities for several other special cases. For some of the classes we prove as well a lower bound for their Chvv atal rank. Finally, we relate the concept of transitive packing to generalized (set) packing and covering as well as to balanced and ideal matrices.
منابع مشابه
Transitive Packing: A Unifying Concept in Combinatorial Optimization
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and the transitive packing polytope. Polytopes that turn out to be special cases of the transitive packing polytope include the node packing, acyclic subdigraph, bipartite subgraph, planar subgraph, clique partitioning, par...
متن کاملPACKING AND DECOMPOSITIONS IN TRANSITIVE TOURNAMENTS – PhD THESIS
In this thesis we shall deal with oriented graphs. The motivation for us is a result by Sali and Simonyi (see also a short proof by Gyárfás) where the existence of the decomposition of transitive tournaments on two isomorphic graphs is shown. In this thesis we start to study a problem of packing in transitive tournaments and we consider decompositions and partitions of transitive tournaments. T...
متن کاملThe number of edge-disjoint transitive triples in a tournament
We prove that a tournament with n vertices has more than 0.13n(1 + o(1)) edge-disjoint transitive triples. We also prove some results on the existence of large packings of k-vertex transitive tournaments in an n-vertex tournament. Our proofs combine probabilistic arguments and some powerful packing results due to Wilson and to Frankl and Rödl.
متن کاملDense Periodic Packings of Tetrahedra with Small Repeating Units
We present a one-parameter family of periodic packings of regular tetrahedra, with the packing fraction 100/117 ≈ 0.8547, that are simple in the sense that they are transitive and their repeating units involve only four tetrahedra. The construction of the packings was inspired from results of a numerical search that yielded a similar packing. We present an analytic construction of the packings ...
متن کاملArbitrary Convex and Concave Rectilinear Module Packing Using the Transitive Closure Graph Representation
In this paper, we deal with arbitrary convex and concave rectilinear module packing using the Transitive Closure Graph (TCG) representation. The geometric meanings of modules are transparent to TCG as well as its induced operations, which makes TCG an ideal representation for floorplanning/placement with arbitrary rectilinear modules. We first partition a rectilinear module into a set of submod...
متن کامل